
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2197. -- [Usaco2011 Mar]Tree Decoration -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2197: [Usaco2011 Mar]Tree Decoration</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>259 MB<br><span class=green>Submit: </span>83&nbsp;&nbsp;<span class=green>Solved: </span>47<br>[<a href='submitpage.php?id=2197'>Submit</a>][<a href='problemstatus.php?id=2197'>Status</a>][<a href='bbs.php?id=2197'>Discuss</a>]</center><h2>Description</h2><div class=content>Farmer John is decorating his Spring Equinox Tree (like a Christmas
tree but popular about three months later). It can be modeled as a
rooted mathematical tree with N (1 <= N <= 100,000) elements, labeled
1...N, with element 1 as the root of the tree. Each tree element e
> 1 has a parent, P_e (1 <= P_e <= N). Element 1 has no parent
(denoted '-1' in the input), of course, because it is the root of
the tree.
Each element i has a corresponding subtree (potentially of size 1)
rooted there. FJ would like to make sure that the subtree corresponding
to element i has a total of at least C_i (0 <= C_i <= 10,000,000)
ornaments scattered among its members. He would also like to minimize
the total amount of time it takes him to place all the ornaments
(it takes time K*T_i to place K ornaments at element i (1 <= T_i
<= 100)).
Help FJ determine the minimum amount of time it takes to place
ornaments that satisfy the constraints.  Note that this answer might
not fit into a 32-bit integer, but it will fit into a signed 64-bit
integer.
For example, consider the tree below where nodes located higher on
the display are parents of connected lower nodes (1 is the root):

            <img border="0" src="images/2197_1.jpg"> 

Suppose that FJ has the following subtree constraints:

           <img border="0" src="images/2197_2.jpg"> 
 
Then FJ can place all the ornaments as shown below, for a total
cost of 20:
  <img border="0" src="images/2197_3.jpg"> 

      FJ要装饰一棵Spring Equinox树（N个节点，标号为1--N，1为根节点）。
输入：
第一行：N         -----代表N个节点
接下来N行
每行三个数P_i     -----i的父亲节点   
           C_i    ----以i为根节点的子树需要至少C_i个装饰品
           T_i    ----在i这个节点挂一个装饰品需要T_i的时间

输出：挂上所有装饰品所需要的总时间

           <img border="0" src="images/2197_4.jpg"> 
</div><h2>Input</h2><div class=content>* Line 1: A single integer: N

* Lines 2..N+1: Line i+1 contains three space-separated integers: P_i,
        C_i, and T_i

</div><h2>Output</h2><div class=content>* Line 1: A single integer: The minimum time to place all the
        ornaments
</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>* Line 1: A single integer: The minimum time to place all the<br />
        ornaments<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>20<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Gold'>Gold</a></p></div><center>[<a href='submitpage.php?id=2197'>Submit</a>][<a href='problemstatus.php?id=2197'>Status</a>][<a href='bbs.php?id=2197'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
